Trivial Connections on Discrete Surfaces
Identifieur interne : 000069 ( Main/Exploration ); précédent : 000068; suivant : 000070Trivial Connections on Discrete Surfaces
Auteurs : Keenan Crane ; Mathieu Desbrun ; Peter Schröder [Allemagne]Source :
- Computer Graphics Forum [ 0167-7055 ] ; 2010-07.
English descriptors
Abstract
This paper presents a straightforward algorithm for constructing connections on discrete surfaces that are as smooth as possible everywhere but on a set of isolated singularities with given index. We compute these connections by solving a single linear system built from standard operators. The solution can be used to design rotationally symmetric direction fields with user‐specified singularities and directional constraints.
Url:
DOI: 10.1111/j.1467-8659.2010.01761.x
Affiliations:
Links toward previous steps (curation, corpus...)
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Trivial Connections on Discrete Surfaces</title><author><name sortKey="Crane, Keenan" sort="Crane, Keenan" uniqKey="Crane K" first="Keenan" last="Crane">Keenan Crane</name></author><author><name sortKey="Desbrun, Mathieu" sort="Desbrun, Mathieu" uniqKey="Desbrun M" first="Mathieu" last="Desbrun">Mathieu Desbrun</name></author><author><name sortKey="Schroder, Peter" sort="Schroder, Peter" uniqKey="Schroder P" first="Peter" last="Schröder">Peter Schröder</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:F88526A5D965503FA1EC2EB5561D659E96DEDB24</idno><date when="2010" year="2010">2010</date><idno type="doi">10.1111/j.1467-8659.2010.01761.x</idno><idno type="url">https://api.istex.fr/document/F88526A5D965503FA1EC2EB5561D659E96DEDB24/fulltext/pdf</idno><idno type="wicri:Area/Main/Corpus">000061</idno><idno type="wicri:Area/Main/Curation">000061</idno><idno type="wicri:Area/Main/Exploration">000069</idno><idno type="wicri:explorRef" wicri:stream="Main" wicri:step="Exploration">000069</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Trivial Connections on Discrete Surfaces</title><author><name sortKey="Crane, Keenan" sort="Crane, Keenan" uniqKey="Crane K" first="Keenan" last="Crane">Keenan Crane</name><affiliation><wicri:noCountry code="subField">Caltech</wicri:noCountry></affiliation></author><author><name sortKey="Desbrun, Mathieu" sort="Desbrun, Mathieu" uniqKey="Desbrun M" first="Mathieu" last="Desbrun">Mathieu Desbrun</name><affiliation><wicri:noCountry code="subField">Caltech</wicri:noCountry></affiliation></author><author><name sortKey="Schroder, Peter" sort="Schroder, Peter" uniqKey="Schroder P" first="Peter" last="Schröder">Peter Schröder</name><affiliation></affiliation><affiliation wicri:level="3"><country>Allemagne</country><placeName><settlement type="city">Munich</settlement><region type="land" nuts="1">Bavière</region><region type="district" nuts="2">District de Haute-Bavière</region></placeName><wicri:orgArea>Institute for Advanced Study</wicri:orgArea></affiliation></author></analytic><monogr></monogr><series><title level="j">Computer Graphics Forum</title><idno type="ISSN">0167-7055</idno><idno type="eISSN">1467-8659</idno><imprint><publisher>Blackwell Publishing Ltd</publisher><pubPlace>Oxford, UK</pubPlace><date type="published" when="2010-07">2010-07</date><biblScope unit="volume">29</biblScope><biblScope unit="issue">5</biblScope><biblScope unit="page" from="1525">1525</biblScope><biblScope unit="page" to="1533">1533</biblScope></imprint><idno type="ISSN">0167-7055</idno></series><idno type="istex">F88526A5D965503FA1EC2EB5561D659E96DEDB24</idno><idno type="DOI">10.1111/j.1467-8659.2010.01761.x</idno><idno type="ArticleID">CGF1761</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0167-7055</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>I.3.3 [Computer Graphics]: Picture/Image Generation—Line and curve generation</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">This paper presents a straightforward algorithm for constructing connections on discrete surfaces that are as smooth as possible everywhere but on a set of isolated singularities with given index. We compute these connections by solving a single linear system built from standard operators. The solution can be used to design rotationally symmetric direction fields with user‐specified singularities and directional constraints.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Bavière</li><li>District de Haute-Bavière</li></region><settlement><li>Munich</li></settlement></list><tree><noCountry><name sortKey="Crane, Keenan" sort="Crane, Keenan" uniqKey="Crane K" first="Keenan" last="Crane">Keenan Crane</name><name sortKey="Desbrun, Mathieu" sort="Desbrun, Mathieu" uniqKey="Desbrun M" first="Mathieu" last="Desbrun">Mathieu Desbrun</name></noCountry><country name="Allemagne"><region name="Bavière"><name sortKey="Schroder, Peter" sort="Schroder, Peter" uniqKey="Schroder P" first="Peter" last="Schröder">Peter Schröder</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Amerique/explor/CaltechV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000069 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000069 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Amerique
|area= CaltechV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:F88526A5D965503FA1EC2EB5561D659E96DEDB24
|texte= Trivial Connections on Discrete Surfaces
}}
| This area was generated with Dilib version V0.6.32. |  |